2 Ja n 20 14 Improved Online Square - into - Square Packing ⋆ Brian
نویسنده
چکیده
In this paper, we show an improved bound and new algorithm for the online square-into-square packing problem. This twodimensional packing problem involves packing an online sequence of squares into a unit square container without any two squares overlapping. The goal is to find the largest area α such that any set of squares with total area α can be packed. We show an algorithm that can pack any set of squares with total area α ≤ 3/8 into a unit square in an online setting, improving the previous bound of 11/32.
منابع مشابه
Improved Online Square-into-Square Packing
In this paper, we show an improved bound and new algorithm for the online square-into-square packing problem. This twodimensional packing problem involves packing an online sequence of squares into a unit square container without any two squares overlapping. The goal is to find the largest area α such that any set of squares with total area α can be packed. We show an algorithm that can pack an...
متن کاملImproved Bound for Online Square-into-Square Packing
We show a new algorithm and improved bound for the online square-into-square packing problem using a hybrid shelf-packing approach. This 2-dimensional packing problem involves packing an online sequence of squares into a unit square container without any two squares overlapping. We seek the largest area α such that any set of squares with total area at most α can be packed. We show an algorithm...
متن کاملImproved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
In this paper, we study 1-space bounded 2-dimensional bin packing and square packing. A sequence of rectangular items (square items, respectively) arrive over time, which must be packed into square bins of size 1×1. 90-rotation of an item is allowed. When an item arrives, we must pack it into an active bin immediately without any knowledge of the future items. The objective is to minimize the t...
متن کاملOnline Algorithms for 1-Space Bounded 2-Dimensional Bin Packing and Square Packing
In this paper, we study 1-space bounded 2-dimensional bin packing and square packing. A sequence of rectangular items (square items) arrive one by one, each item must be packed into a square bin of unit size on its arrival without any information about future items. When packing items, 90◦-rotation is allowed. 1-space bounded means there is only one “active” bin. If the “active” bin cannot acco...
متن کاملPacking 10 or 11 Unit Squares in a Square
Let s(n) be the side of the smallest square into which it is possible pack n unit squares. We show that s(10) = 3 + √ 1 2 ≈ 3.707 and that s(11) ≥ 2 + 2 √ 4 5 ≈ 3.789. We also show that an optimal packing of 11 unit squares with orientations limited to 0◦ or 45◦ has side 2+2 √ 8 9 ≈ 3.886. These results prove Martin Gardner’s conjecture that n = 11 is the first case in which an optimal result r...
متن کامل